problem with inequality constraint造句
例句與造句
- We present and analyze a modified penalty functions ( mpf ) method for solving constrained optimization problems with inequality constraints . this method combines the modified penalty and the lagrangian methods
本文提出并分析一種解決不等式約束最優(yōu)化問題的修改的罰函數(shù)法，這一方法綜合利用修改的罰函數(shù)和拉格朗日法。 - The model of dwell function synthesis of planar six - bar mechanism in the dissertation is decomposed into two relatively independent sub - questions . the first one is to evaluate the characteristic of points on moving rigid body , whose mathematics model is a kind of special non - differential max - mini optimal problem with inequality constraints
對于誤差評定，本文利用加權(quán)理論，對要求綜合的平面六桿機構(gòu)提出了在保證間歇部分精度要求的條件下，使非間歇部分誤差盡可能小的評價思想。 - For applying the hybrid optimization algorithm to solve the optimization problem with constraints , a self - adaptive penalty strategy for handling the constraints is designed , which is used to convert the optimization problem with inequality constraints and equality constraints to the one only with the upper and lower bound constraints of the decision variables
為了便于應用混合優(yōu)化算法對約束優(yōu)化問題進行求解，設計了一種處理約束條件的自適應懲罰策略，用于將具有不等式約束和等式約束的優(yōu)化問題轉(zhuǎn)變?yōu)閮H包含決策變量上、下限約束的優(yōu)化問題。 - Chapter 2 establishes the theoretical framework of a class of dual algorithms for solving nonlinear optimization problems with inequality constraints . we prove , under some mild assumptions , the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions . the modified barrier function methods of polyak ( 1992 ) and the augmented lagrange function method of bertsekas ( 1982 ) are verified to be the special cases of the class of dual algorithms
第2章建立求解不等式約束優(yōu)化問題的一類對偶算法的理論框架，在適當?shù)募僭O條件下，證明了該類算法的局部收斂性質(zhì)，并給出近似解的誤差界，驗證了polyak ( 1992 )的修正障礙函數(shù)算法以及bertsekas ( 1982 )的增廣lagrange函數(shù)算法都是這類算法的特例。 - It's difficult to find problem with inequality constraint in a sentence. 用problem with inequality constraint造句挺難的